Three-Manifolds Having Complexity At Most 9

3-manifolds Having Complexity at Most 9

3-manifolds Having Complexity at Most 9 Introduction

Contents 1 Complexity theory and an overview of the algorithm 3 1. 2 Surfaces and transverse surfaces in a spine 15 2.

Three-manifolds with Heegaard genus at most two represented by crystallisations with at most 42 vertices

It is known that every closed compact orientable 3-manifold M can be represented by a 4-edge-coloured 4-valent graph called a crystallisation of M. Casali and Grasselli proved that 3-manifolds of Heegaard genus g can be represented by crystallisations with a very simple structure which can be described by a 2(g +1)-tuple of non-negative integers. The sum of first g +1 integers is called complex...

Complexity of geometric three-manifolds

We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev’s natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show that the upper bounds on Matveev’s complexity implied by our computations are sharp for thousands of manifolds, and we conjecture they are for infinitely many, ...

Spanning Caterpillars Having at Most k Leaves

A tree is called a caterpillar if all its leaves are adjacent to the same its path, and the path is called a spine of the caterpillar. Broersma and Tuinstra proved that if a connected graph G satisfies σ2(G) ≥ |G| − k + 1 for an integer k ≥ 2, then G has a spanning tree having at most k leaves. In this paper we improve this result as follows. If a connected graph G satisfies σ2(G) ≥ |G|−k+1 and...